ProLogICA: a practical system for Abductive Logic Programming

نویسندگان

  • Oliver Ray
  • Antonis Kakas
چکیده

This paper presents a new system called ProLogICA for Abductive Logic Programming (ALP) with Negation as Failure (NAF) and Integrity Constraints (ICs). The system builds upon existing ALP techniques but includes several optimisations and extensions necessitated by recent applications in computational biology, temporal reasoning and machine learning. Unlike some other ALP systems that support non-ground abduction through the integrated use of constraint solving, we adopt a more lightweight approach which avoids this complexity at the expense of only computing ground hypotheses. We argue our approach is suited to a wide class of real-world problems and demonstrate the effectiveness of ProLogICA on three non-trivial applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Practical Tabled Abduction in Logic Programs

Despite its potential as a reasoning paradigm in AI applications, abduction has been on the back burner in logic programming, as abduction can be too difficult to implement, and costly to perform, in particular if abductive solutions are not tabled. If they become tabled, then abductive solutions can be reused, even from one abductive context to another. On the other hand, current Prolog system...

متن کامل

Nonmonotonic abductive inductive learning

Inductive Logic Programming (ILP) is concerned with the task of generalising sets of positive and negative examples with respect to background knowledge expressed as logic programs. Negation as Failure (NAF) is a key feature of logic programming which provides a means for nonmonotonic commonsense reasoning under incomplete information. But, so far, most ILP research has been aimed at Horn progr...

متن کامل

Towards Practical Tabled Abduction Usable in Decision Making

Abduction as reasoning paradigm has been much explored in Artificial Intelligence, but not yet taken up by decision making as much as its potential warrants. Indeed, abduction permits the generation of hypothetical knowledge based scenarios, about which one can then equate decisions. One reason for this state of affairs is that abduction is difficult to implement efficaciously, even by experts,...

متن کامل

Practical Tabled Abduction in Logic Programs

Abduction has by now been employed in various applications using logic programming. But abduction can be costly to perform, if abductive solutions are not tabled, and their reuse allowed even in distinct contexts. Current Prologlike systems, with their tabling mechanisms, are mature enough to facilitate the introduction of tabled abduction into them. This poses a problem of how to actually reus...

متن کامل

Integration of Abductive Reasoning and Constraint Optimization in SCIFF

Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP constraints. These two frameworks have been merged in works by various authors, who developed efficient abductive proof-procedures empowered with constraint satisfaction techniques. However, while almost all CLP languages provide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006